Upper Bounds in Discrepancy Theory
نویسنده
چکیده
Through the use of a few examples, we shall illustrate the use of probability theory, or otherwise, in the study of upper bound questions in the theory of irregularities of point distribution. Such uses may be Monte Carlo in nature but the most efficient ones appear to be quasi Monte Carlo in nature. Furthermore, we shall compare the relative merits of probabilistic and non-probabilistic techniques, as well as try to understand the actual role that the probability theory plays in some of these arguments.
منابع مشابه
The Inverse of the Star-discrepancy Depends Linearly on the Dimension
We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, ε) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at most ε. We prove that n∞(d, ε) depends linearly on d and at most quadratically on ε−1. We present three upper bounds on n∞(d, ε), all of them are based on probabilistic arguments and therefore they are no...
متن کاملUpper Bounds in Classical Discrepancy Theory
We discuss some of the ideas behind the study of upper bound questions in classical discrepancy theory. The many ideas involved come from diverse areas of mathematics and include diophantine approximation, probability theory, number theory and various forms of Fourier analysis. We illustrate these ideas by largely restricting our discussion to two dimensions.
متن کاملBracketing numbers for axis-parallel boxes and applications to geometric discrepancy
In the first part of this paper we derive lower bounds and constructive upper bounds for the bracketing numbers of anchored and unanchored axis-parallel boxes in the d-dimensional unit cube. In the second part we apply these results to geometric discrepancy. We derive upper bounds for the inverse of the star and the extreme discrepancy with explicitly given small constants and an optimal depend...
متن کاملBounds for the Average Lp-Extreme and the L∞-Extreme Discrepancy
The extreme or unanchored discrepancy is the geometric discrepancy of point sets in the d-dimensional unit cube with respect to the set system of axis-parallel boxes. For 2 ≤ p < ∞ we provide upper bounds for the average Lp-extreme discrepancy. With these bounds we are able to derive upper bounds for the inverse of the L∞-extreme discrepancy with optimal dependence on the dimension d and explic...
متن کاملThe probabilistic method for upper bounds in domination theory
Domination is a rapidly developing area of research in graph theory, and its various applications to ad hoc networks, distributed computing, social networks and web graphs partly explain the increased interest. This thesis focuses on domination theory, and the main aim of the study is to apply a probabilistic approach to obtain new upper bounds for various domination parameters. Chapters 2 and ...
متن کاملLow Discrepancy Sequences and Learning
The Discrepancy Method is a constructive method for proving upper bounds that has received a lot of attention in recent years. In this paper we revisit a few important results, and show how it can be applied to problems in Machine Learning such as the Empirical Risk Minimization and Risk Estimation by exploiting connections with combinatorial dimension theory.
متن کامل